N-matrix completion problem
نویسندگان
چکیده
منابع مشابه
The N 10 - Matrix Completion Problem
An n×n matrix is called an N1 0 -matrix if all its principal minors are non-positive and each entry is non-positive. In this paper, we study general combinatorially symmetric partial N1 0 -matrix completion problems and prove that a combinatorially symmetric partial N1 0 -matrix with all specified offdiagonal entries negative has an N1 0 -matrix completion if the graph of its specified entries ...
متن کاملThe partial non - combinatorially symmetric N 10 - matrix completion problem
An n×n matrix is called an N 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N 0 -completion. Therefore, we have given sufficient conditions ...
متن کاملThe Q-matrix completion problem
Abstract. A real n × n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k × k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix. For the Q-completion problem, sufficient conditions for a digraph to have Q-completion are given, necessary conditions for a digraph to have Q-completion are...
متن کاملThe Nonsingular Matrix Completion Problem
An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a NS-matrix (TNS-matrix) completion. Here, we ...
متن کاملThe CP-Matrix Completion Problem
A symmetric matrix A is completely positive (CP) if there exists an entrywise nonnegative matrix B such that A = BB . We characterize the interior of the CP cone. We formulate the problem as linear optimizations with cones of moments. A semidefinite algorithm is proposed for checking interiors of the CP cone, and its properties are studied. A CP-decomposition of a matrix in Dickinson’s form can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(03)00500-7